An hybrid genetic algorithm for two-dimensional cutting problems using guillotine cuts

The paper deals with the purpose of one hybrid approach for solving the constrained two-dimensional cutting (2DC) problem. We study this hybrid approach that combines the genetic algorithm and the Tabu search method. For this problem, we assume a packing of a whole number of rectangular pieces to cut, and that all cuts are of guillotine type in one sheet of a fixed width and an infinite height. Finally, we undertake an extensive experimental study with a large number of problem instances extracted from the literature by the Hopper’s Benchmarks in order to support and to proove our approach and to evaluate the performance.